package kr.hkit.powerjava.chapter12.work;

import java.util.Scanner;
class BinarySearch {
	private int[] arr = {5, 4, 8, 2, 7, 1, 9, 3, 6, 10};
	private int mid;
	private int left;
	private int right;
	private int searchKey;
	private int size;
	Scanner input = new Scanner(System.in);
	
	public BinarySearch() { }
	public BinarySearch(int size, int searchKey)	{
		this.arr = new int[size];
		this.searchKey = searchKey;
	}
	
	public void init() {	}
	
	public void prnArray() {
		for (int i = 0; i < arr.length ; i++) {
			System.out.printf("%-2d",arr[i]);
		}
	}
	
	public void binarySort(int[] arr) {
		this.arr = arr;
		this.mid = 10/2;	// size/2;
		this.left = arr[0];
		this.right = arr[size-1];
	}
	
	public void binarySearch() {
		
	}
}

public class BinarySearchTest {
	public static void main(String[] args) {
//		BinarySearch b = new BinarySearch(5);
//		b.prnArray();
	}
}


